Adjacency labeling schemes and induced-universal graphs

We describe a way of assigning labels to the vertices of any undirected graph on up to $n$ vertices, each composed of $n/2+O(1)$ bits, such that given the labels of two vertices, and no other information regarding the graph, it is possible to decide whether or not the vertices are adjacent in the graph. This is optimal, up to an additive constant, and constitutes the first improvement in almost 50 years of an $n/2+O(\log n)$ bound of Moon. As a consequence, we obtain an induced-universal graph for $n$-vertex graphs containing only $O(2^{n/2})$ vertices, which is optimal up to a multiplicative constant, solving an open problem of Vizing from 1968. We obtain similar tight results for directed graphs, tournaments and bipartite graphs

Angular Normal Modes of a Circular Coulomb Cluster

We investigate the angular normal modes for small oscillations about an equilibrium of a single-component coulomb cluster confined by a radially symmetric external potential to a circle. The dynamical matrix for this system is a Laplacian symmetrically circulant matrix and this result leads to an analytic solution for the eigenfrequencies of the angular normal modes. We also show the limiting dependence of the largest eigenfrequency for large numbers of particles

Inverse Avalanches On Abelian Sandpiles

A simple and computationally efficient way of finding inverse avalanches for Abelian sandpiles, called the inverse particle addition operator, is presented. In addition, the method is shown to be optimal in the sense that it requires the minimum amount of computation among methods of the same kind. The method is also conceptually nice because avalanche and inverse avalanche are placed in the same footing.Comment: 5 pages with no figure IASSNS-HEP-94/7

A General Design Rule for Bearing Failure of Bolted Connections Between Cold-formed Steel Strips

This paper presents the results of a finite element investigation on the structural performance of cold-formed steel bolted connections. A parametric study on various connection configurations was performed to relate the bearing resistances of cold-formed steel bolted connections with steel strengths and thicknesses, and bolt diameters. A semi-empirical design rule for bearing resistances of bolted connections based on finite element results is proposed in which the bearing resistances are directly related with the design yield strength, and the design tensile strength of steel strips, steel thickness, and also with bolt diameters. Design expressions for resistance contributions due to both bearing and friction actions are given after calibration against finite element results

Experimental Investigation of Cold-formed Steel Beam-column Sub-frames: Pilot Study

This paper presents the findings of an experimental investigation on the structural performance of bolted moment connections in cold-formed steel beam-column sub-frames. A total of eight tests with three different connection configurations in both internal and external columns were carried out. Double lipped C-sections back-to-back with hot rolled steel gusset plates of 10 mm and of 16 mm in two different shapes were tested; four bolts per member were used in the connections. Among the tests, three different modes of failure were identified and the measured moment resistances at the connections were found to vary from 36% to 97% of the measured moment capacities of the cold-formed steel sections, demonstrating that bolted moment connections between cold-formed steel members are structurally feasible and economical. Furthermore, structural members with double lipped C sections back-to-back are shown to be practical in constructing short to medium span portal frames with bolted moment connections through rational design

Calculation of a Class of Three-Loop Vacuum Diagrams with Two Different Mass Values

We calculate analytically a class of three-loop vacuum diagrams with two different mass values, one of which is one-third as large as the other, using the method of Chetyrkin, Misiak, and M\"{u}nz in the dimensional regularization scheme. All pole terms in \epsilon=4-D (D being the space-time dimensions in a dimensional regularization scheme) plus finite terms containing the logarithm of mass are kept in our calculation of each diagram. It is shown that three-loop effective potential calculated using three-loop integrals obtained in this paper agrees, in the large-N limit, with the overlap part of leading-order (in the large-N limit) calculation of Coleman, Jackiw, and Politzer [Phys. Rev. D {\bf 10}, 2491 (1974)].Comment: RevTex, 15 pages, 4 postscript figures, minor corrections in K(c), Appendix B removed, typos corrected, acknowledgements change

Non-perturbative corrections to mean-field behavior: spherical model on spider-web graph

We consider the spherical model on a spider-web graph. This graph is effectively infinite-dimensional, similar to the Bethe lattice, but has loops. We show that these lead to non-trivial corrections to the simple mean-field behavior. We first determine all normal modes of the coupled springs problem on this graph, using its large symmetry group. In the thermodynamic limit, the spectrum is a set of $\delta$-functions, and all the modes are localized. The fractional number of modes with frequency less than $\omega$ varies as $\exp (-C/\omega)$ for $\omega$ tending to zero, where $C$ is a constant. For an unbiased random walk on the vertices of this graph, this implies that the probability of return to the origin at time $t$ varies as $\exp(- C' t^{1/3})$, for large $t$, where $C'$ is a constant. For the spherical model, we show that while the critical exponents take the values expected from the mean-field theory, the free-energy per site at temperature $T$, near and above the critical temperature $T_c$, also has an essential singularity of the type $\exp[ -K {(T - T_c)}^{-1/2}]$.Comment: substantially revised, a section adde

Random Vibrational Networks and Renormalization Group

We consider the properties of vibrational dynamics on random networks, with random masses and spring constants. The localization properties of the eigenstates contrast greatly with the Laplacian case on these networks. We introduce several real-space renormalization techniques which can be used to describe this dynamics on general networks, drawing on strong disorder techniques developed for regular lattices. The renormalization group is capable of elucidating the localization properties, and provides, even for specific network instances, a fast approximation technique for determining the spectra which compares well with exact results.Comment: 4 pages, 3 figure

Resiliently evolving supply-demand networks

Peer reviewedPublisher PD